Multiple Lagrange Multiplier Method for Constrained Evolutionary Optimization
نویسندگان
چکیده
One of the well-known problems in evolutionary search for solving optimization problem is the premature convergence. The general constrained optimization techniques such as hybrid evolutionary programming, two{phase evolutionary programming, and Evolian algorithms are not safe from the same problem in the rst phase. To overcome this problem, we apply the sharing function to the Evolian algorithm and propose to use the multiple Lagrange multiplier method for the subsequent phases of Evolian. The method develops Lagrange multipliers in each subpopulation region independently and nds multiple global op-tima in parallel. The simulation results demonstrates the usefulness of the proposed sharing technique and the multiple Lagrange multiplier method.
منابع مشابه
A Genetic Algorithm Based Augmented Lagrangian Method for Accurate, Fast and Reliable Constrained Optimization
Among the penalty based approaches for constrained optimization, augmented Lagrangian (AL) methods are better in at least three ways: (i) they have theoretical convergence properties, (ii) they distort the original objective function minimally, thereby providing a better function landscape for search, and (iii) they can result in computing optimal Lagrange multiplier for each constraint as a by...
متن کاملEvolutionary Programming Techniques For Constrained Optimization Problems - Evolutionary Computation, IEEE Transactions on
Two evolutionary programming (EP) methods are proposed for handling nonlinear constrained optimization problems. The first, a hybrid EP, is useful when addressing heavily constrained optimization problems both in terms of computational efficiency and solution accuracy. But this method offers an exact solution only if both the mathematical form of the objective function to be minimized/maximized...
متن کاملBayesian Image Restoration and Segmentationby Constrained
A constrained optimization method, called the Lagrange-Hoppeld (LH) method, is presented for solving Markov random eld (MRF) based Bayesian image estimation problems for restoration and segmentation. The method combines the augmented Lagrangian mul-tiplier technique with the Hoppeld network to solve a constrained optimization problem into which the original Bayesian estimation problem is reform...
متن کاملImage Restoration and Segmentation by Constrained Optimization 3
(C) 1998 IEEE Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract The combinatorial optimization problem of MAP esti...
متن کاملEvolian: Evolutionary Optimization Based on Lagrangian with Constraint Scaling
In this paper, an evolutionary optimization method, Evolian, is proposed for the general constrained optimization problem, which incorporates the concept of (1) a multi-phase optimization process and (2) constraint scaling techniques to resolve problem of ill-conditioning. In each phase of Evolian, the typical evolutionary programming (EP) is performed using an augmented Lagrangian objective fu...
متن کامل